Exactness of the Original Grover Search Algorithm
نویسنده
چکیده
Zijian Diao Mathematics Department, Ohio University Eastern Campus, St Clairsville, OH 43950, USA∗ Abstract It is well-known that when searching one out of four, the original Grover’s search algorithm is exact; that is, it succeeds with certainty. It is natural to ask the inverse question: If we are not searching one out of four, is Grover’s algorithm definitely not exact? In this article we give a complete answer to this question through some rationality results of trigonometric functions.
منابع مشابه
Dynamic Grover Search: Applications in Recommendation systems and Optimization problems
In the recent years we have seen that Grover search algorithm [1] by using quantum parallelism has revolutionized the field of solving huge class of NP problems in comparison to classical systems. In this work we explore the idea of extending the Grover search algorithm to approximate algorithms. Here we try to analyze the applicability of Grover search to process an unstructured database with ...
متن کاملPhase Condition for the Grover Algorithm
Quantum algorithms standardly use two techniques: Fourier transforms [1] and amplitude amplification. The Grover search algorithm is based on the latter. The problem addressed by the Grover algorithm is to find a marked term (or target term in [2]) in an unsorted database of size N . To accomplish this, a quantum computer needs O (√ N ) queries using the Grover algorithm [3]. In Grover’s origin...
متن کاملA General SU (2) Formulation for Quantum Searching with Certainty
A general quantum search algorithm with arbitrary unitary transformations and an arbitrary initial state is considered in this work. To serach a marked state with certainty, we have derived, using an SU(2) representation: (1) the matching condition relating the phase rotations in the algorithm, (2) a concise formula for evaluating the required number of iterations for the search, and (3) the fi...
متن کاملEfficient Centrality Monitoring for Time-Evolving Graphs
The goal of this work is to identify the nodes that have the smallest sum of distances to other nodes (the lowest closeness centrality nodes) in graphs that evolve over time. Previous approaches to this problem find the lowest centrality nodes efficiently at the expense of exactness. The main motivation of this paper is to answer, in the affirmative, the question, ‘Is it possible to improve the...
متن کاملOptimization of Partial Search
Quantum Grover search algorithm can find a target item in a database faster than any classical algorithm. One can trade accuracy for speed and find a part of the database (a block) containing the target item even faster, this is partial search. A partial search algorithm was recently suggested by Grover and Radhakrishnan. Here we optimize it. Efficiency of the search algorithm is measured by nu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010